例句與造句

1. Now the heap property is violated since 8 is greater than 4.
2. This will generally violate the heap property, and so the elements are then sifted up until the heap property has been reestablished.
3. This will generally violate the heap property, and so the elements are then sifted up until the heap property has been reestablished.
4. The validity of the tree structure is ensured by creating a certificate at each edge that enforces the heap property on that edge.
5. The heapify procedure can be thought of as building a heap from the bottom up by successively sifting downward to establish the heap property.
6. It's difficult to find heap property in a sentence. 用heap property造句挺難的
7. In the first, the heap is grown by repeatedly adding the next unsorted element, and performing rearrangements to restore the heap properties.
8. In this case, swapping the two elements, 4 and 8, is enough to restore the heap property and we need not swap elements further:
9. This can however be wasteful as each Extract-Min ( H ) and Insert ( H, x ) typically have to maintain the heap property.
10. Then starting from the lowest level and moving upwards, sift the root of each subtree downward as in the deletion algorithm until the heap property is restored.
11. For the above algorithm to correctly re-heapify the array, the node at index " i " and its two direct children must violate the heap property.
12. We first place the 15 in the position marked by the X . However, the heap property is violated since 15 > 8, so we need to swap the 15 and the 8.
13. Each tree maintains the max-heap property that each node is always at least as large as either of its children ( and thus the root of the tree is the largest element of all ).
14. If both heaps contain a tree of order " j ", the two trees are merged to one tree of order " j " + 1 so that the minimum-heap property is satisfied.
15. The downward-moving node is swapped with the " larger " of its children in a max-heap ( in a min-heap it would be swapped with its smaller child ), until it satisfies the heap property in its new position.
16. To insert a new item into the heap, the item is appended to the end of the array, and then while the heap property is violated it is swapped with its parent, moving it upward in the tree and earlier in the array, until eventually the heap property is satisfied.
更多例句：  下一頁